Isomorphism Properties on Strong Fuzzy Hypergraphs
نویسندگان
چکیده
منابع مشابه
Properties of Bipolar Fuzzy Hypergraphs
In this article, we apply the concept of bipolar fuzzy sets to hypergraphs and investigate some properties of bipolar fuzzy hypergraphs. We introduce the notion of A− tempered bipolar fuzzy hypergraphs and present some of their properties. We also present application examples of bipolar fuzzy hypergraphs.
متن کاملIsomorphism on Fuzzy Graphs
In this paper, the order, size and degree of the nodes of the isomorphic fuzzy graphs are discussed. Isomorphism between fuzzy graphs is proved to be an equivalence relation. Some properties of self complementary and self weak complementary fuzzy graphs are discussed. Keywords—complementary fuzzy graphs, co-weak isomorphism, equivalence relation, fuzzy relation, weak isomorphism.
متن کاملCompetition hypergraphs of digraphs with certain properties I. Strong connectedness
If D = (V,A) is a digraph, its competition hypergraph CH(D) has the vertex set V and e ⊆ V is an edge of CH(D) iff |e| ≥ 2 and there is a vertex v ∈ V , such that e = {w ∈ V |(w, v) ∈ A}. We tackle the problem to minimize the number of strong components in D without changing the competition hypergraph CH(D). The results are closely related to the corresponding investigations for competition gra...
متن کاملSome topological properties of fuzzy strong b-metric spaces
In this study, we investigate topological properties of fuzzy strong b-metric spaces defined in [13]. Firstly, we prove Baire's theorem for these spaces. Then we define the product of two fuzzy strong b-metric spaces defined with same continuous t-norms and show that $X_{1}times X_{2}$ is a complete fuzzy strong b-metric space if and only if $X_{1}$ and $X_{2}$ are complete fu...
متن کاملA 2-Isomorphism Theorem for Hypergraphs
One can associate a polymatroid with a hypergraph that naturally generalises the cycle matroid of a graph. Whitney's 2-isomorphism theorem characterises when two graphs have isomorphic cycle matroids. In this paper Whitney's theorem is generalised to hypergraphs and polymatroids by characterising when two hyper-graphs have isomorphic associated polymatroids. 1997 Academic Press
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2013
ISSN: 0975-8887
DOI: 10.5120/10598-5296